搜索资源列表
java
- 寻找素数,并计算出最大十个数的和-To find prime numbers, and calculate the maximum number of 10 and
sushu
- 用C++的类的概念写的一个有关寻找一定范围内素数个数并把它们输出的C++源程序-With C++ The concept of the class written by a certain range to find the number of prime numbers and their output C++ Source
PrimeNumber
- 这是一个查找1到50内的素数的JAVA程序,-This is a 1-50 to find prime numbers within the JAVA program,
panduansushu
- 判断一个数是否为素数:输入一个数,判断它是否为素数.-To determine whether a number of prime numbers: Enter a number to determine whether it is prime.
e11
- 求球体的表面积 判断一个数是否为素数 求球体的表面积 判断一个数是否为素数-Sphere of surface area for a few to judge whether the prime number for a sphere of surface area to determine whether the number of prime numbers
million
- million Berin的具体算法,可以进行生成1-10000的所有素数-million Berin specific algorithm, can generate all the prime numbers 1-10000
primefind
- 计算十亿以内的素数 并以文本形式存储. 通过更改参数可以缩小范围-Calculation of prime numbers within a billion and stored in text form. By changing the parameters can reduce the scope of
1024RSA
- 支持大整数的RSA算法,还可以自动生成随机大素数-Support for large integer RSA algorithm, can also automatically generate random large prime numbers
sushuo
- 筛法筛素数,结构很好 效率也不错!算法思想很好!-Sieve Method sieve prime numbers, the structure of the efficiency of good very good! Algorithm good thinking!
pb
- 一些大学生PD实验的代码和设计。是一个学生信息管理系统,可以输入学生信息数据。以及求水仙花数,求素数之类的小程序-Some college PD code and design of experiments. Is a student information management system, students can enter data. And for a few daffodils, and prime numbers, such as applet
shiyan12
- 编制具有如下原型的函数prime,用来判断整数n是否为素数:bool prime(int n) 而后编制主函数,任意输入一个大于4的偶数d,找出满足d=d1+d2的所有数对,其中要求d1与d2均为素数(通过调用prime来判断素数)。如偶数18可以分解为11+7以及13+5;而偶数80可以分解为:43+37、61+19、67+13、73+7。 提示:i与d-i的和恰为偶数d,而且只有当i与d-i均为奇数时才有可能成为所求的“数对”。 -Prepared with the follow
12
- 12. 编制具有如下原型的函数prime,用来判断整数n是否为素数:bool prime(int n) 而后编制主函数,任意输入一个大于4的偶数d,找出满足d=d1+d2的所有数对,其中要求d1与d2均为素数(通过调用prime来判断素数)。如偶数18可以分解为11+7以及13+5;而偶数80可以分解为:43+37、61+19、67+13、73+7。 提示:i与d-i的和恰为偶数d,而且只有当i与d-i均为奇数时才有可能成为所求的“数对”。 -12. The preparation o
primecalculator
- 计算百亿内素数个数的效率极高的算法,采用动态分配内存和倒筛法,文件夹内附有报告。-Calculating the number of prime numbers in tens of billions of extremely efficient algorithms, dynamic allocation of memory and inverted sieve method, the folder containing the report.
0067
- 采用DELPHI实现哥德巴赫猜想,大于等于4的数写成两个素数的和。-DELPHI used to achieve Goldbach conjecture, greater than or equal to 4 several languages and the two prime numbers.
bigint
- 大素数生成。用于加密解密。具体内容:用C或C++语言编写的一个生成二进制为1024位的大素数的程序。-Generate large prime numbers. For encryption and decryption. Specific elements: using C or C++ Language to prepare a generation of binary for the 1024 program of large prime numbers.
RSA
- RSA加密算法的基本实现,大素数的选取方面有限制-RSA encryption algorithm of the basic realization of large prime numbers to select a restricted area
sushusuanfafenxi
- 介绍利用VisualBasic语言判定和筛选素数的基本算法及改进方案。-VisualBasic language to introduce the use of prime numbers and screening to determine the basic algorithm and improve the program.
rsa
- 1) 找出两个相异的大素数P和Q,令N=P×Q,M=(P-1)(Q-1)。 2) 找出与M互素的大数E,用欧氏算法计算出大数D,使D×E≡1 MOD M。 3) 丢弃P和Q,公开E,D和N。E和N即加密密钥,D和N即解密密钥。 -1) to identify two different large prime numbers P and Q, so N = P × Q, M = (P-1) (Q-1). 2) to identify and M large numbers cop
sushu
- 用函数过程判断某数是否为素数,利用此函数完成: 1、输出3-100之间的素数; 2、验证哥德巴赫猜想(每一个大于2的偶数都可以表示为两个素数的和)即对于一个偶数。输出他的所有素数和的形式。-Function of the process used to determine whether a number of prime numbers, use this function to complete: 1, the output of the prime numbers between
xm1099
- Miller-Rabin随机性素数测试,能有效的判断一个小于2^63次方的数是不是素数。-Miller-Rabin prime randomness tests, can effectively determine whether a power of less than 2 ^ 63 is the number of prime numbers.